Перевод: со всех языков на все языки

со всех языков на все языки

it's a brute of a problem

См. также в других словарях:

  • Brute force — may refer to: * Brute force search, a trivial computer problem solving technique * Brute force attack, a method of defeating a cryptographic scheme by trying a large number of possibilities * Proof by exhaustion or brute force method, a method of …   Wikipedia

  • Brute fact — Brute facts are opposed to institutional facts, in that the former do not require the context of an institution to occur. The term was coined by G. E. M. Anscombe and then popularized by John Searle.For instance, the fact that a certain piece of… …   Wikipedia

  • Brute-force search — In computer science, brute force search or exhaustive search, also known as generate and test, is a trivial but very general problem solving technique that consists of systematically enumerating all possible candidates for the solution and… …   Wikipedia

  • Brute-force attack — The EFF s US$250,000 DES cracking machine contained over 1,800 custom chips and could brute force a DES key in a matter of days. The photograph shows a DES Cracker circuit board fitted with 32 Deep Crack chips and some control chips. In… …   Wikipedia

  • brute force — noun /bɹut ˈfɔɹs/ a) A method of accomplishing something primarily by means of strength, without the use of mechanical aids or, in combat, without strategic planning or tactics. E.g. to find the set of all positive integers that are multiples of… …   Wiktionary

  • Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …   Wikipedia

  • Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …   Wikipedia

  • 8-Damen-Problem — a b c d e f g h …   Deutsch Wikipedia

  • Acht-Damen-Problem — a b c d e f g h …   Deutsch Wikipedia

  • N-Damen-Problem — a b c d e f g h …   Deutsch Wikipedia

  • Vertex cover problem — In computer science, the vertex cover problem or node cover problem is an NP complete problem and was one of Karp s 21 NP complete problems. It is often used in complexity theory to prove NP hardness of more complicated problems. Definition A… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»